Graph Compositions: Deleting Edges from Complete Graphs
نویسندگان
چکیده
Graph compositions are related to compositions of positive integers and partitions of finite sets, and have applications in electrical networks. This paper provides extensions of a previously known result which states that C(K N ) = B(N) B(N 2), where B(N) represents the N th Bell number and C(K N ) is the complete graph on N vertices with one edge deleted.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملPer-spectral and adjacency spectral characterizations of a complete graph removing six edges
Cámara and Haemers (2014) investigatedwhen a complete graphwith some edges deleted is determined by its adjacency spectrum (DAS for short). They claimed: for anym ≥ 6 and every large enough n one can obtain graphswhich are not DAS by removingm edges from a complete graph Kn. LetGn denote the set of all graphs obtained from a complete graph Kn by deleting six edges. In this paper, we show that a...
متن کاملAnti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملTotal domination in $K_r$-covered graphs
The inflation $G_{I}$ of a graph $G$ with $n(G)$ vertices and $m(G)$ edges is obtained from $G$ by replacing every vertex of degree $d$ of $G$ by a clique, which is isomorph to the complete graph $K_{d}$, and each edge $(x_{i},x_{j})$ of $G$ is replaced by an edge $(u,v)$ in such a way that $uin X_{i}$, $vin X_{j}$, and two different edges of $G$ are replaced by non-adjacent edges of $G_{I}$. T...
متن کامل